Smallest Graphs Achieving the Stinson Bound
نویسندگان
چکیده
منابع مشابه
Graphs with smallest forgotten index
The forgotten topological index of a molecular graph $G$ is defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes the degree of vertex $u$ in $G$. The first through the sixth smallest forgotten indices among all trees, the first through the third smallest forgotten indices among all connected graph with cyclomatic number $gamma=1,2$, the first through<br /...
متن کاملThe Smallest Cubic Graphs of Girth Nine
We describe two computational methods for the construction of cubic graphs with given girth. These were used to produce two independent proofs that the (3, 9)-cages, defined as the smallest cubic graphs of girth 9, have 58 vertices. There are exactly 18 such graphs. We also show that cubic graphs of girth 11 must have at least 106 vertices and cubic graphs of girth 13 must have at least 196 ver...
متن کاملThe smallest eigenvalue of Kr-free graphs
Let G be a Kr+1-free graph with n vertices and m edges, and let n (G) be the smallest eigenvalue of its adjacency matrix. We show that
متن کاملBiprimitive Graphs of Smallest Order
A regular and edge-transitive graph which is not vertex-transitive is said to be semisymmetric. Every semisymmetric graph is necessarily bipartite, with the two parts having equal size and the automorphism group acting transitively on each of these parts. A semisymmetric graph is called biprimitive if its automorphism group acts primitively on each part. In this paper biprimitive graphs of smal...
متن کاملMaximum size of a minimum watching system and the graphs achieving the bound
Soit G = (V (G), E(G)) un graphe non orienté. Un contrôleur w de G est une paire w = ((w), A(w)), o` u (w) appartientà V (G) et A(w) est un ensemble de sommets de G ` a distance 0 ou 1 de (w). Si un sommet v appartientà A(w), on dit que v est couvert par w. Deux sommets v 1 sommets quelconques v 1 , v 2 sont séparés par W. On dénote le nombre minimum de contrôleurs nécessaires pour contrôler G ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2020
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2020.2965102